Quantization Using Permutaton Codes with a Uniform Source
نویسنده
چکیده
Permutation coding is a block coding/quantization scheme where the codebook is comprised entirely of permutations of a single starting vector. Permutation codes for the uniform source are developed using a simple algorithm. The performance of these codes is compared against scalar codes and permutation codes developed by different methodologies. It is shown that the algorithm produces codes as good as other more complex methods. Theoretical predictions of code design parameters and code performance is verified by numerical simulations.
منابع مشابه
Generalizations of Permutation Source Codes
Permutation source codes are a class of structured vector quantizers with a computationally-simple encoding procedure. In this thesis, we provide two extensions that preserve the computational simplicity but yield improved operational rate–distortion performance. In the first approach, the new class of vector quantizers has a codebook comprising several permutation codes as subcodes. Methods fo...
متن کاملLow-Delay Distributed Source Coding: Bounds and Performance of Practical Codes
The performance of distributed source coding methods based on scalar quantization followed by scalar entropy coding is investigated. For a fixed quantizer, the problem is converted to that of zero-error entropy coding for bipartite graphs with a special structure. It is then experimentally shown that for bipartite graphs corresponding to jointly Gaussian sources and high-resolution uniform quan...
متن کاملError Correction in DFT Codes Subject to Low-Level Quantization Noise
This paper analyzes the effects of quantization noise on the error correcting capability of a popular class of real-number Bose-Chaudhuri-Hocquenguem (BCH) codes known as discrete Fourier transform (DFT) codes. Among other uses, DFT codes heve been proposed for joint source-channel coding because their robustness to channel noise is apparently superior to the classical tandem source-channel cod...
متن کاملLinear code-based vector quantization for independent random variables
The computationally efficient vector quantization for a discrete time source can be performed using lattices over block linear codes or convolutional codes. For high rates (low distortion) and uniform distribution the performance of a multidimensional lattice depends mainly on the normalized second moment (NSM) of the lattice. For relatively low rates (high distortions) and non-uniform distribu...
متن کاملBinary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments
We determine analytic expressions for the performance of some low-complexity combined source-channel coding systems. The main tool used is the Hadamard transform. In particular, we obtain formulas for the average distortion of binary lattice vector quantization with affine index assignments, linear block channel coding, and a binary-symmetric channel. The distortion formulas are specialized to ...
متن کامل